Signature Schemes Based on Birational Permutations
نویسنده
چکیده
Many public key cryptographic schemes (such a s c u b i c RSA) are based on low degree polynomials whose inverses are high degree polynomials. These functions are very easy to compute but time consuming to invert even by their legitimate users. To m a k e such s c hemes more eecient, we consider in this paper the class of birational permutations f over k-tuples of numbers, in which both f and f ;1 are low degree rational functions. We develop two n e w families of birational permutations, and show h o w to transform them into new public key signature schemes which are much faster than the known schemes.
منابع مشابه
Efficient Signature Schemes Based on Birational Permutations
Many public key cryptographic schemes (such as cubic RSA) are based on low degree polynomials whose inverses are high degree polynomials. These functions are very easy to compute but time consuming to invert even by their legitimate users. To make such schemes more eecient, we consider in this paper the class of birational permutations f over k-tuples of numbers, in which both f and f ?1 are lo...
متن کاملFurther Attacks on the Birational Permutation Signature Schemes
At Crypto 93, Shamir [3] proposed two signature schemes based on birational permutations. Coppersmith, Stern and Vaudenay [2] presented the first attacks on both cryptosystems. These attacks do not recover the secret key. For one of the variants proposed by Shamir we show how to recover the secret key.
متن کاملThe Security of the
In recent years, researchers have invested a lot of eeort in trying to design suitable alternatives to the RSA signature scheme, with lower computational requirements. The idea of using polynomial equations of low degree in several unknowns, with some hidden trap-door, has been particularly attractive. One of the most noticeable attempt to push this idea forward is the Ong-Schnorr-Shamir signat...
متن کاملDouble voter perceptible blind signature based electronic voting protocol
Mu et al. have proposed an electronic voting protocol and claimed that it protects anonymity of voters, detects double voting and authenticates eligible voters. It has been shown that it does not protect voter's privacy and prevent double voting. After that, several schemes have been presented to fulfill these properties. However, many of them suffer from the same weaknesses. In this p...
متن کاملArtemia: a family of provably secure authenticated encryption schemes
Authenticated encryption schemes establish both privacy and authenticity. This paper specifies a family of the dedicated authenticated encryption schemes, Artemia. It is an online nonce-based authenticated encryption scheme which supports the associated data. Artemia uses the permutation based mode, JHAE, that is provably secure in the ideal permutation model. The scheme does not require the in...
متن کامل